Domain decomposition for a non-smooth convex minimization problem and its application to plasticity

نویسنده

  • Carsten Carstensen
چکیده

P.L. Lions's work on the Schwarz alternating method for convex minimization problems is generalized to a certain non-smooth situation where the non-diierentiable part of the functionals is additive and independent with respect to the decomposition. Such functionals arise naturally in plasticity where the material law is a variational inequality formulated in L 2 ((). The application to plasticity with hardening is sketched and gives contraction numbers which are independent of the discretization parameter h and of a possible regularization of the non-smooth material law. 1. Introduction Domain decomposition is proved to be an important tool for parallel computations in the numerical analysis of partial diierential equations. The Schwarz method does converge for many diierent types of problems because of two reasons: the rst is that it has a variational interpretation and the second one is its interpretation in terms of the maximum principle L, p.2]. Motivated by the study of elastoplasticity (see

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lifted coordinate descent for learning with trace-norm regularization

We consider the minimization of a smooth loss with trace-norm regularization, which is a natural objective in multi-class and multitask learning. Even though the problem is convex, existing approaches rely on optimizing a non-convex variational bound, which is not guaranteed to converge, or repeatedly perform singular-value decomposition, which prevents scaling beyond moderate matrix sizes. We ...

متن کامل

حل مسئله پخش بار بهینه در شرایط نرمال و اضطراری با استفاده از الگوریتم ترکیبی گروه ذرات و نلدر مید (PSO-NM)

In this paper, solving optimal power flow problem has been investigated by using hybrid particle swarm optimization and Nelder Mead Algorithms. The goal of combining Nelder-Mead (NM) simplex method and particle swarm optimization (PSO) is to integrate their advantages and avoid their disadvantages. NM simplex method is a very efficient local search procedure but its convergence is extremely sen...

متن کامل

Linear Objective Function Optimization with the Max-product Fuzzy Relation Inequality Constraints

In this paper, an optimization problem with a linear objective function subject to a consistent finite system of fuzzy relation inequalities using the max-product composition is studied. Since its feasible domain is non-convex, traditional linear programming methods cannot be applied to solve it. We study this problem and capture some special characteristics of its feasible domain and optimal s...

متن کامل

A full ranking method using integrated DEA models and its application to modify GA for finding Pareto optimal solution of MOP problem

This paper uses integrated Data Envelopment Analysis (DEA) models to rank all extreme and non-extreme efficient Decision Making Units (DMUs) and then applies integrated DEA ranking method as a criterion to modify Genetic Algorithm (GA) for finding Pareto optimal solutions of a Multi Objective Programming (MOP) problem. The researchers have used ranking method as a shortcut way to modify GA to d...

متن کامل

Waveform Design using Second Order Cone Programming in Radar Systems

Transmit waveform design is one of the most important problems in active sensing and communication systems. This problem, due to the complexity and non-convexity, has been always the main topic of many papers for the decades. However, still an optimal solution which guarantees a global minimum for this multi-variable optimization problem is not found. In this paper, we propose an attracting met...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Numerical Lin. Alg. with Applic.

دوره 4  شماره 

صفحات  -

تاریخ انتشار 1997